Embeddings on Torus-Butterfly Interconnection Network
نویسندگان
چکیده
منابع مشابه
A Torus Assignment for an Interconnection Network Recursive Diagonal Torus
Recursive Diagonal Torus (RDT) is a class of interconnection network consisting of recursively overlaid twodimensional square diagonal tori for massively parallel computers with up to 2 nodes. Connection structures of the RDT vary according to the assignment of upper rank diagonal tori into a node. Although traditional simple assignment called RDT(2,4,1)/ shows enough performance under the unif...
متن کاملImproved Meta-Flattened Butterfly Multistage Interconnection Network
Parallel processing is efficient form of information processing which means to implement high performance computing systems. A communication network that links processors and memory modules determines the efficiency of these parallel systems. To provide the required connectivity and performance at reasonable cost, an interconnection network is used. Hence, multistage interconnection networks ar...
متن کاملBlue Gene/L torus interconnection network
interconnection network N. R. Adiga M. A. Blumrich D. Chen P. Coteus A. Gara M. E. Giampapa P. Heidelberger S. Singh B. D. Steinmacher-Burow T. Takken M. Tsao P. Vranas The main interconnect of the massively parallel Blue Genet/L is a three-dimensional torus network with dynamic virtual cut-through routing. This paper describes both the architecture and the microarchitecture of the torus and a ...
متن کاملEmbeddings into the Pancake Interconnection Network
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and hypercubes into the pancake with constant dilation and congestion. We also extend the results to similar efficient embeddings into the star graph.
متن کاملRecursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers
ÐRecursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to 2 nodes. By making the best use of a recursively structured diagonal mesh (torus) connection, the RDT has a smaller diameter (e.g., it is 11 for 2 nodes) with a smaller number of links per node (i.e., 8 links per node) than those of the hypercube. A simple routing algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2012
ISSN: 2249-0868
DOI: 10.5120/ijais12-450817